Non - interactive data release for distributive queries with differential privacy
نویسندگان
چکیده
Differential privacy is emerging as a strong notion for protecting individual privacy in privacy preserving data analysis or publishing. While it has been proven that it is possible to non-interactively release a database that are useful for all queries satisfying certain constraints with differential privacy, there is still a lack of general and efficient methods for achieving the data release. We propose a novel and efficient method for non-interactive data release for distributive queries with differential privacy. We examine queries with unlimited and limited output domain respectively and propose different differential privacy mechanisms which simultaneously guarantees differential privacy and the usefulness of released data. We also instantiate the general method for different queries including interval queries, parity queries and max queries. In addition to providing formal proofs of the differential privacy and usefulness guarantees of the released data using our method, we also present a set of experimental results and demonstrate the actual feasibility and performance of our method for different queries.
منابع مشابه
Differentially Private Data Release through Multidimensional Partitioning
Differential privacy is a strong notion for protecting individual privacy in privacy preserving data analysis or publishing. In this paper, we study the problem of differentially private histogram release based on an interactive differential privacy interface. We propose two multidimensional partitioning strategies including a baseline cell-based partitioning and an innovative kd-tree based par...
متن کاملFast Private Data Release Algorithms for Sparse Queries
We revisit the problem of accurately answering large classes of statistical queries while preserving differential privacy. Previous approaches to this problem have either been very general but have not had run-time polynomial in the size of the database, have applied only to very limited classes of queries, or have relaxed the notion of worst-case error guarantees. In this paper we consider the...
متن کاملA A Learning Theory Approach to Non-Interactive Database Privacy
In this paper we demonstrate that, ignoring computational constraints, it is possible to release synthetic databases that are useful for accurately answering large classes of queries while preserving differential privacy. Specifically, we give a mechanism that privately releases synthetic data useful for answering a class of queries over a discrete domain with error that grows as a function of ...
متن کاملISPE: Adaptive Differentially Private Data Release and Query Estimation
Although the mechanism of differential privacy provides a strong guarantee for privacy protection, it remains a key open problem to find efficient algorithms for non-interactive differentially private data release while maintaining good utility. In this paper, we propose an adaptive framework, called ISPE, to release differentially private histogram data through an interactive differentially pr...
متن کاملUnderstanding the Sparse Vector Technique for Differential Privacy
The Sparse Vector Technique (SVT) is a fundamental technique for satisfying differential privacy and has the unique quality that one can output some query answers without apparently paying any privacy cost. SVT has been used in both the interactive setting, where one tries to answer a sequence of queries that are not known ahead of the time, and in the non-interactive setting, where all queries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010